package com.kobeliu.entity;

/**
 * leetcode No.4
 *  两个有序数组的中位数
 *  二分查找
 */
public class Demo_12 {

    public static void main(String[] args) {

        int[] nums1 = {1,2};
        int[] nums2 = {3};

        System.out.println(findMedianSortedArrays(nums1,nums2));

    }

    private static double findMedianSortedArrays(int[] nums1, int[] nums2) {
        if(nums1.length<nums2.length){
            int[] temp = nums1;
            nums1 = nums2;
            nums2 = temp;
        }

        int n = nums1.length+nums2.length;
        int L = nums1.length/2;
        int R = nums2.length/2;


        return 0;
    }
}
